منابع مشابه
Probabilistic Analysis of the Grassmann Condition Number
We perform an average analysis of the Grassmann condition number C (A) for the homogeneous convex feasibility problem ∃x ∈ C \ 0 : Ax = 0, where C ⊂ R may be any regular cone. This in particular includes the cases of linear programming, second-order programming, and semidefinite programming. We thus give the first average analysis of convex programming, which is not restricted to linear program...
متن کاملReinforcement Learning State Estimator
In this study, we propose a novel use of reinforcement learning for estimating hidden variables and parameters of nonlinear dynamical systems. A critical issue in hidden-state estimation is that we cannot directly observe estimation errors. However, by defining errors of observable variables as a delayed penalty, we can apply a reinforcement learning frame-work to state estimation problems. Spe...
متن کاملIsogeometric Analysis: Condition Number Estimates and Fast Solvers
Isogeometric methods were introduced by Hughes et al. in 2005. Since its introduction these methods have been used in many practical problems in science and engineering. However, so far, only few papers appeared in the field of iterative solvers for these methods. This thesis contributes to the development of fast iterative solvers for the matrices arising in isogeometric discretization of elli...
متن کاملSmoothed Analysis of Interior-Point Algorithms: Condition Number
A linear program is typically specified by a matrix A together with two vectors b and c, where A is an n-by-d matrix, b is an n-vector and c is a d-vector. There are several canonical forms for defining a linear program using (A, b, c). One commonly used canonical form is: max cx s.t. Ax ≤ b and its dual min by s.t A y = c, y ≥ 0. In [Ren95b, Ren95a, Ren94], Renegar defined the condition number...
متن کاملA Condition Number Analysis of a Surface-Surface Intersection Algorithm
The problem of finding all intersections between two surfaces has many applications in computational geometry and computer-aided geometric design. We propose an algorithm based on Newton’s method and subdivision for this problem. Our algorithm uses a test based on the Kantorovich theorem to prevent the divergence or slow convergence problems normally associated with using unsuitable starting po...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Power Systems
سال: 2001
ISSN: 0885-8950
DOI: 10.1109/59.918298